Making Recommendations Bandwidth Aware

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Presenting Diversity Aware Recommendations: Making Challenging News Acceptable

Recommender systems find relevant content for us online, including the personalized news we increasingly receive on Twitter and Facebook. As a consequence of personalization, we increasingly see content that agrees with our views, we cease to be exposed to views contrary to our own. Both algorithms and the users themselves filter content, and this creates more polarized points of view, so calle...

متن کامل

Context-aware Recommendations

This article illustrates the vivid research field of hybrid and context-aware recommender systems. Moreover, two own approaches to deal with context-awareness in recommender systems, are described in detail.

متن کامل

Presenting Diversity Aware Recommendations:

Recommender systems find relevant content for us online, including the personalized news we increasingly receive on Twitter and Facebook. As a consequence of personalization, we increasingly see content that agrees with our views, we cease to be exposed to views contrary to our own. Both algorithms and the users themselves filter content, and this creates more polarized points of view, so calle...

متن کامل

Making Contribution-Aware P2P Systems Robust to Collusion Attacks Using Bandwidth Puzzles

Many peer-to-peer (P2P) content-distribution systems reward a peer based on its contribution to the system, specifically the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowledge, an open problem; e.g., in a simple form of “ballot stuffing” attack, a group of colluding attackers can earn rewards by claiming to have served content to one anot...

متن کامل

Making Contribution-Aware Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles

Many peer-assisted content-distribution systems reward a peer based on the amount of datathat this peer serves to others. However, validating that a peer did so is, to our knowledge, anopen problem; e.g., a group of colluding attackers can earn rewards by claiming to have servedcontent to one another, when they have not. We propose a bandwidth puzzle mechanism tomake contributio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2018

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2018.2853548